143 research outputs found

    On periodic stable Auslander-Reiten components containing Heller lattices over the symmetric Kronecker algebra

    Full text link
    Let O\mathcal{O} be a complete discrete valuation ring, K\mathcal{K} its quotient field, and let AA be the symmetric Kronecker algebra over O\mathcal{O}. We consider the full subcategory of the category of AA-lattices whose objects are AA-lattices MM such that MβŠ—OKM\otimes_{\mathcal{O}}\mathcal{K} is projective AβŠ—OKA\otimes_{\mathcal{O}}\mathcal{K}-modules. In this paper, we study Heller lattices of indecomposable periodic modules over the symmetric Kronecker algebra. As a main result, we determine the shapes of stable Auslander-Reiten components containing Heller lattices of indecomposable periodic modules over the symmetric Kronecker algebra.Comment: 35 pages (v1), correct several errors (v2

    Uniform Cyclic Group Factorizations of Finite Groups

    Full text link
    In this paper, we introduce a kind of decomposition of a finite group called a uniform group factorization, as a generalization of exact factorizations of a finite group. A group GG is said to admit a uniform group factorization if there exist subgroups H1,H2,…,HkH_1, H_2, \ldots, H_k such that G=H1H2β‹―HkG = H_1 H_2 \cdots H_k and the number of ways to represent any element g∈Gg \in G as g=h1h2β‹―hkg = h_1 h_2 \cdots h_k (hi∈Hih_i \in H_i) does not depend on the choice of gg. Moreover, a uniform group factorization consisting of cyclic subgroups is called a uniform cyclic group factorization. First, we show that any finite solvable group admits a uniform cyclic group factorization. Second, we show that whether all finite groups admit uniform cyclic group factorizations or not is equivalent to whether all finite simple groups admit uniform group factorizations or not. Lastly, we give some concrete examples of such factorizations.Comment: 10 pages. To appear in Communications in Algebr
    • …
    corecore